Steiner Tree Problems

نویسندگان

  • Ding-Zhu Du
  • Bing Lu
  • Hung Q. Ngo
  • Panos M. Pardalos
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A 4-Approximation Algorithm for k-Prize Collecting Steiner Tree Problems

This paper studies a 4-approximation algorithm for k-prize collecting Steiner tree problems. This problem generalizes both k-minimum spanning tree problems and prize collecting Steiner tree problems. Our proposed algorithm employs two 2-approximation algorithms for k-minimum spanning tree problems and prize collecting Steiner tree problems. Also our algorithm framework can be applied to a speci...

متن کامل

Solving a tri-objective convergent product network using the Steiner tree

Considering convergent product as an important manufacturing technology for digital products, we integrate functions and sub-functions using a comprehensive fuzzy mathematical optimization process. To form the convergent product, a web-based fuzzy network is considered in which a collection of base functions and sub-functions configure the nodes and each arc in the network is to be a link betwe...

متن کامل

A catalog of Hanan grid problems

We present a general rectilinear Steiner tree problem in the plane and prove that it is solvable on the Hanan grid of the input points. This result is then used to show that several variants of the ordinary rectilinear Steiner tree problem are solvable on the Hanan grid, including | but not limited to | Steiner trees for rectilinear (or iso-thetic) polygons, obstacle-avoiding Steiner trees, gro...

متن کامل

Better approximation bounds for the network and Euclidean Steiner tree problems

The network and Euclidean Steiner tree problems require a shortest tree spanning a given vertex subset within a network G = (V; E; d) and Euclidean plane, respectively. For these problems, we present a series of heuristics nding approximate Steiner tree with performance guarantee coming arbitrary close to 1+ln2 1:693 and 1+ln 2 p 3 1:1438, respectively. The best previously known corresponding v...

متن کامل

New Approximation Algorithms for the Steiner Tree Problems

The Steiner tree problem asks for the shortest tree connecting a given set of terminal points in a metric space. We design new approximation algorithms for the Steiner tree problems using a novel technique of choosing Steiner points in dependence on the possible deviation from the optimal solutions. We achieve the best up to now approximation ratios of 1.644 in arbitrary metric and 1.267 in rec...

متن کامل

On the hardness of full Steiner tree problems

Given a weighted graph G = (V,E) and a subset R of V , a Steiner tree in G is a tree which spans all vertices in R. The vertices in V \R are called Steiner vertices. A full Steiner tree is a Steiner tree in which each vertex of R is a leaf. The full Steiner tree problem is to find a full Steiner tree with minimum weight. The bottleneck full Steiner tree problem is to find a full Steiner tree wh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009